Gröbner Geometry of Vertex Decompositions and of Flagged Tableaux

نویسنده

  • ALLEN KNUTSON
چکیده

We relate a classic algebro-geometric degeneration technique, dating at least to [Hodge 1941], to the notion of vertex decompositions of simplicial complexes. The good case is when the degeneration is reduced, and we call this a geometric vertex decomposition. Our main example in this paper is the family of vexillary matrix Schubert varieties, whose ideals are also known as (one-sided) ladder determinantal ideals. Using a diagonal term order to specify the (Gröbner) degeneration, we show that these have geometric vertex decompositions into simpler varieties of the same type. From this, together with the combinatorics of the pipe dreams of [Fomin– Kirillov 1996], we derive a new formula for the numerators of their multigraded Hilbert series, the double Grothendieck polynomials, in terms of flagged set-valued tableaux. This unifies work of [Wachs 1985] on flagged tableaux, and [Buch 2002] on set-valued tableaux, giving geometric meaning to both. This work focuses on diagonal term orders, giving results complementary to those of [Knutson–Miller 2004], where it was shown that the generating minors form a Gröbner basis for any antidiagonal term order and anymatrix Schubert variety. We show here that under a diagonal term order, the only matrix Schubert varieties for which these minors form Gröbner bases are the vexillary ones, reaching an end toward which the ladder determinantal literature had been building.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Flagged Schur Functions, Schubert Polynomials, and Symmetrizing Operators

Flagged Schur functions are generalizations of Schur functions. They appear in the work of Lascoux and Schutzenberger [2] in their study of Schubert polynomials. Gessel [ 1 ] has shown that flagged Schur functions can be expressed both as a determinant in the complete homogeneous symmetric functions and in terms of column-strict tableaux just as can ordinary Schur functions (Jacobi-Trudi identi...

متن کامل

Geometric vertex decompositions

We relate vertex decompositions of simplicial complexes to Gröbner degeneration, in stages, of affine varieties. v cone on the link deletion

متن کامل

Tableau Complexes

Let X, Y be finite sets and T a set of functions from X → Y which we will call “tableaux”. We define a simplicial complex whose facets, all of the same dimension, correspond to these tableaux. Such tableau complexes have many nice properties, and are frequently homeomorphic to balls, which we prove using vertex decompositions [BP79]. In our motivating example, the facets are labeled by semistan...

متن کامل

Fair Factorizations of the Complete Multipartite Graph and Related Edge-Colorings by

In this dissertation, first the technique of vertex amalgamations is used to extend known results on graph decompositions, and in particular on decompositions of the complete multipartite graph K(n, p) with p parts, each of which has n vertices. The decompositions focus on hamilton cycles and 1-factors that satisfy certain fairness notions, as well as frame versions of these results where each ...

متن کامل

Maximal Fillings of Moon Polyominoes, Simplicial Complexes, and Schubert Polynomials

We exhibit a canonical connection between maximal (0, 1)-fillings of a moon polyomino avoiding north-east chains of a given length and reduced pipe dreams of a certain permutation. Following this approach we show that the simplicial complex of such maximal fillings is a vertex-decomposable, and thus shellable, sphere. In particular, this implies a positivity result for Schubert polynomials. Mor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005